Developments in Implicit Complexity (DICE 2012)
نویسندگان
چکیده
منابع مشابه
Recent Developments in Parallelization of the Multidimensional Integration Package DICE
DICE is a general purpose multidimensional numerical integration package. There can be two ways in the parallelization of DICE, “distributing random numbers into workers” and “distributing hypercubes into workers”. Furthermore, there can be the combination of both ways. So far, we had developed the parallelization code using the former way and reported it in ACAT2002 in Moscow. Here, we will pr...
متن کاملImplicit complexity in recursive analysis
Recursive analysis is a model of analog computation which is based on type 2 Turing machines. Various classes of functions computable in recursive analysis have recently been characterized in a machine independent and algebraical context. In particular nice connections between the class of computable functions (and some of its sub and supclasses) over the reals and algebraically defined (suband...
متن کاملQuantum implicit computational complexity
We introduce a quantum lambda calculus inspired by Lafont’s Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP and ZQP. The calculus is based on the ‘‘classical control and quantum data’’ paradigm. This is the first example of a formal systemcapturing quantumcomplexity classes in the spirit of implicit computational complexity — it is machine-free and no explicit...
متن کاملQuantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by one of us), Light Affine Logic and Soft Affine Logic. The proofs are based on a common semantical framework which is merely instantiated in four different ways...
متن کاملRealizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semantic framework previously introduced by the authors and based on an innovativemodification of realizability. The proof is a notable simplification on the original already semantic pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.03.001